Fractional Rate Dataflow Model for Efficient Code Synthesis
نویسندگان
چکیده
Automatic code synthesis from dataflow program graphs is a promising high-level design methodology for rapid prototyping of multimedia embedded systems. Memory efficient code synthesis from dataflow models has been an active research subject to reduce the gap in terms of memory requirements between the synthesized code and the hand-optimized code. However, existent dataflow models have inherent difficulty of efficiently handling data structures. In this paper, we propose a new dataflow extension called fractional rate dataflow (FRDF) in which fractional number of samples can be produced and consumed. In the proposed FRDF model, a constituent data type is considered as a fraction of the composite data type. Existent integer rate dataflow models can be easily extended to incorporate the fractional rates without loosing analytical properties. In this paper, the SDF model is extended to include FRDF, which can reduce the buffer memory requirements significantly, up to 70%, for some multimedia applications. Extended SDF model with fractional rate has been implemented in our system design environment called PeaCE(Ptolemy extension as Codesign Environment).
منابع مشابه
Efficient Cosynthesis from Extended Dataflow Graphs for Multimedia Applications
This thesis addresses problems in automatic code synthesis especially for multimedia applications since automatic code synthesis is a promising high level design methodolgy for rapid prototyping as system complextiy increases and fast design turn-aroud time becomes important. However, there are some problems to support multimedia applications in the high level design methodology. Multimedia app...
متن کاملOptimized RTL Code Generation from Coarse-Grain Dataflow Specification for Fast HW/SW Cosynthesis
This paper presents a new methodology of automatic RTL code generation from coarse-grain dataflow specification for fast HW/SW cosynthesis. A node in a coarse-grain dataflow specification represents a functional block such as FIR and DCT and an arc may deliver multiple data samples per block invocation, which complicates the problem and distinguishes it from behavioral synthesis problem. Given ...
متن کاملMemory Efficient Software Synthesis from Dataflow Graph
Due to the limited amount of memory resources in embedded systems, minimizing the memory requirements is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data size for software synthesis from graphical DSP programs based on the synchronous dataflow (SDF) model. By sharing the kernel code among multiple instances of a block, we can further r...
متن کاملMemory efficient software synthesis with mixed coding style from dataflow graphs
This paper presents a set of techniques to reduce the code and data sizes for software synthesis from graphical digital signal-processing programs based on the synchronous dataflow model. By sharing the kernel code among multiple instances of a block with a shared function, we can further reduce the code size below the previous results based on inline coding style. A systematic approach also is...
متن کاملCompact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Synthesis of digital signal processing (DSP) software from dataflowbased formal models is an effective approach for tackling the complexity of modern DSP applications. In this paper, an efficient method is proposed for applying subroutine call instantiation of module functionality when synthesizing embedded software from a dataflow specification. The technique is based on a novel recursive deco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- VLSI Signal Processing
دوره 37 شماره
صفحات -
تاریخ انتشار 2004